// Copyright (C) 2023 Computer Vision Lab, Electrical Engineering, 
// Indian Institute of Science, Bengaluru, India.
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
//       copyright notice, this list of conditions and the following
//       disclaimer in the documentation and/or other materials provided
//       with the distribution.
//     * Neither the name of Indian Institute of Science nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING 
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 
// DEALINGS IN THE SOFTWARE.
// 
// 
// This file is a part of the implementation for the paper:
// Chitturi Sidhatha, Lalit Manam and Venu Madhav Govindu, 
// Adaptive Annealing for Robust Geometric Estimation,
// Proceedings of the Computer Vision and Pattern Recognition 2023
// 
// This code base is adapted from the code release of Fast Global Registration,
// Qian-Yi Zhou, Jaesik Park, and Vladlen Koltun, ECCV 2016

#include <stdio.h>
#include "app.h"

int main(int argc, char *argv[])
{
	// // This function will stay as it is according to the original gom.
	// if (argc != 4)
	// {
    //     printf("Usage ::\n");
	// 	printf("%s [feature_01] [feature_02] [transform_output_txt]\n", argv[0]);
	// 	return 0;
	// }
	// gom::CApp app;
	// app.ReadFeature(argv[1]);
	// app.ReadFeature(argv[2]);
	// app.NormalizePoints();
	// app.OptimizePairwise(true);
	// app.WriteTrans(argv[3]);

	return 0;
}
